Littlewood-richardson Semigroups

نویسنده

  • ANDREI ZELEVINSKY
چکیده

This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. We discuss the problem of finding an explicit description of the semigroup LRr of triples of partitions of length ≤ r such that the corresponding Littlewood-Richardson coefficient is non-zero. After discussing the history of the problem and previously known results, we suggest a new approach based on the “polyhedral” combinatorial expressions for the Littlewood-Richardson coefficients. This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. I thank the organizers (Sergey Fomin, Curtis Greene, Phil Hanlon and Sheila Sundaram) for bringing together a group of outstanding combinatorialists and for giving me a chance to bring to their attention some of the problems that I find very exciting and beautiful.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Littlewood-Richardson fillings and their symmetries

Abstract Considering the classical definition of the Littlewood-Richardson rule and its 2-dimensional representation by means of rectangular tableaux, we exhibit 24 symmetries of this rule when considering dualization, conjugation and their composition. Extending the Littlewood-Richardson rule to sequences of nonnegative real numbers, six of these symmetries may be generalized. Our point is to ...

متن کامل

Estimating deep Littlewood-Richardson Coefficients

Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups (GLn). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for Littlewood-Richardson coefficients corresponding to indices sufficiently far from the boundary of the Littlewood Richardson cone. 2. A proof of approximate log-concav...

متن کامل

A max-flow algorithm for positivity of Littlewood-Richardson coefficients

Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL(n,C). They have a wide variety of interpretations in combinatorics, representation theory and geometry. Mulmuley and Sohoni pointed out that it is possible to decide the positivity of Littlewood-Richardson coefficients in polynomial time...

متن کامل

Littlewood-richardson Coeecients and Kazhdan-lusztig Polynomials

We show that the Littlewood-Richardson coeecients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for aane symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously introduced in 21] in terms of ribbon tableaux.

متن کامل

Equivariant Littlewood-richardson Skew Tableaux

We give a positive equivariant Littlewood-Richardson rule also discovered independently by Molev. Our proof generalizes a proof by Stembridge of the ordinary Littlewood-Richardson rule. We describe a weight-preserving bijection between our indexing tableaux and the Knutson-Tao puzzles.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997